• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    The invention relates to a method for processing a data delivery request sent by a client terminal to a remote server equipment via a telecommunications network, said terminal being adapted to access said network by means of a minus two links according to distinct access types, said data having been encoded into at least one stream at at least a predetermined bit rate, said stream having been previously cut into a plurality of segments. The method according to the invention is particular in that it comprises the following steps, implemented for a segment of said at least one data stream: - Determination (E4) of at least one sub-segment size at least the number of links and the size of the data stream to be delivered; - Calculation (E5) of partitioning the segment into sub-segments according to said at least one determined size and a distribution of the sub-segments on the plurality of links at least according to a scheduling of the sub-segments in calculated partitioning and a predetermined time constraint; - Emitting (E6) a plurality of transmission requests of the sub-segments to the server on the plurality of links, at least according to the calculated distribution, a transmission request of a sub-segment on a link comprising at least a segment identifier, a sub-segment start index, and a sub-segment end index.
    公开号:FR3029376A1
    申请号:FR1461650
    申请日:2014-11-28
    公开日:2016-06-03
    发明作者:Patrice Houze
    申请人:Orange SA；B Com SAS；
    IPC主号:
    专利说明:

    [0001] The subject matter of the invention is that of the delivery of data from a server. to a customer via at least one telecommunications network. The invention may especially, but not exclusively, apply to the delivery of multimedia data streams according to a technology of the "http adaptive streaming" type. 2. Presentation of the Prior Art The MPEG-DASH (for Dynamic Adaptive Streaming over http) standard is a technique for delivering multimedia data by an HTTP server equipment (for "Hypertext Transfer Protocol", in English) to a DASH client equipment, according to which multimedia data is divided into segments, which are encoded at several bit rates. This technique is notably described in the article entitled "Dynamic Adaptive Streaming over http- Standards and Design Principles", by Thomas Stockhannmer, published in Proceedings of the ACM Conference on Multimedia Systems, February 2011, pages 133-144. In connection with Figure 1, the UE DASH client equipment connects to the ES server equipment via an RT communication network. The ES server equipment has several data files Fi, F2, F3, ... FN thus correspond to the same segment, encoded with different qualities. The DASH client equipment that wishes to receive the multimedia data streams, begins by asking the server equipment to transmit a description file type MPD (for "Media Presentation Description" in English) multimedia data. This file describes in particular the files corresponding to the segments available on the server equipment and their associated bit rate. The client uses the description data of this file to determine, for each segment, the file that corresponds to the speed of his choice, according to the bandwidth he has at a given moment and to define the delivery request to be sent to the server equipment.
    [0002] A first advantage of this technique is that it is simple. The fact of being based on the http protocol solves the problem of the passage of firewalls ("firewalls" in English) and the server equipment comes down to a WEB server, generic, inexpensive and easy to deploy on a large scale .
    [0003] A second advantage of this technique is that it is adaptive. The client equipment adapts its request to the bandwidth it has, by choosing a segment encoded at a higher or lower rate. For example, the client device first requests the delivery of high throughput files for the first segments, and then switches to lower throughput files for subsequent segments when it encounters a momentary bandwidth problem. 3. Disadvantages of the Prior Art A first drawback of this technique lies in the large size of the segments available at the server, which corresponds in the case of a video sequence, to a duration of between 3 and 10 seconds. When the network conditions are not optimal, its transmission may experience a delay or latency that is not compatible with real-time constraints. A disadvantage of this technique comes from the fact that it uses http which relies on the protocol of control of transmission TCP (for "Transport Control Protocol", in English). Such a protocol establishes a connection between the server equipment and the client equipment and allows the transmission of data securely by an exchange of acknowledgment. However, this signaling introduces a delay, due to retransmissions of lost data packets, which excludes the possibility of real time delivery. 4. Objectives of the invention The invention improves the situation. The invention particularly aims to overcome these disadvantages of the prior art.
    [0004] More specifically, an objective of the invention is to propose a solution that enables the delivery of multimedia data in real time, that is to say with latency constraints close to those of conversational services, while retaining the benefits of DASH adaptive streaming technology, especially in terms of deployment cost. 5. Objective of the invention These objectives, as well as others which will appear later, are achieved by means of a method of processing a data delivery request sent by a client terminal intended for sending data. a remote server equipment via a telecommunications network, said terminal being adapted to access said network by at least two links according to distinct types of access, said data having been encoded in at least one stream to at least a predetermined flow rate, said flow having been previously cut into a plurality of segments. The method according to the invention is particular in that it comprises the following steps, implemented for a segment of said at least one data stream: - Determination of at least one sub-segment size at least as a function of the number links and a size of the data stream to be delivered; - Calculation of partitioning of the segment into sub-segments according to said at least one determined size and distribution of the sub-segments on the plurality of links at least according to a scheduling of the sub-segments in the partitioning calculated and a predetermined time constraint; and - sending a plurality of requests for transmission of the sub-segments to the server on the plurality of links, at least according to the calculated distribution, a transmission request of a sub-segment on a link comprising at least one identifier segment, a sub-segment start index, and a sub-segment end index.
    [0005] With the invention, the request for delivery of a segment of the data stream is converted into a plurality of sub-requests on each of the links available to access the communication network. Subqueries are for one or more sub-segments that are smaller than the entire segment.
    [0006] Thus, the invention is based on a completely new and inventive approach to multimedia data delivery, based, on the one hand, on a decision to split a segment of data encoded into sub-segments of sizes adapted at least by depending on the number of links available in parallel and on the other hand, on a distribution of sub-requests on these links. Requiring smaller sub-segments than the segment reduces the delivery latency. Using multiple network accesses for the same delivery maximizes the use of available resources and reduces overall delivery time. An advantage of the invention is not to modify the operations of the network and the server equipment. Indeed, the invention is based on a known operation of a web server, which allows it to respond to a request for delivery of a section of a multimedia data stream comprising positioning information of this section in the file. According to an advantageous characteristic of the invention, the method further comprises a step of measuring parameters representative of a state of the network on the plurality of links, implemented on reception of sub-segments from the server on said links in response to requests issued and a step of updating the steps of determining a sub-segment size per link and calculating a partitioning and distribution of sub-segments on the links according to the measured parameters.
    [0007] Following the reception of the first sub-segments on the various links, representative parameters of a network state on these links are measured and exploited to adapt the size of a sub-segment by link and to refine the distribution of requests between the links. different links. The measured network parameters are characteristic of link efficiency and include, for example, latency, peak rate, loss rate, and network jitter. Advantageously, it is possible to assign weights to the links according to the calculated network parameters to take these weights into account in the step of distributing the sub-segments on the links.
    [0008] According to another aspect of the invention, the method comprises a step of determining a transmission frequency of the requests on a link according to the measured network parameters and in that the transmission requests of the sub-segments on said link are issued. at the specified transmission frequencies. This makes it possible to set up a burst mode, according to which the client equipment does not wait for the response of the server equipment to a first request on one link to send another on the same link, in order not to not be constrained by a sequential mode that would slow down the transmission of data from a link. The frequency or transmission rate is chosen in a suitable manner so as not to saturate the network link. According to another aspect of the invention, the method further comprises a step of obtaining a coding structure comprising at least one piece of information representative of a type of coded data in the segment associated with a position information of the data of this type, a step of assigning a decoding priority level to the sub-segments of a segment based on the type information and predetermined rules, and in that the partitioning step of the segment under segments and the step of distributing the sub-segments on the plurality of links also take into account the levels of decoding priorities assigned to the sub-segments. An advantage of assigning decoding priority levels to sub-segments is to allow the implementation of a strategy for distributing sub-requests on available links, which favors the highest priority sub-segments and requests. on the most reliable links. For example, a high decoding priority level is assigned to the sub-segments containing coded data belonging to an Intra (or I) type image, since such an image serves as a reference for decoding other images. It is therefore important to ensure reliable delivery. It is understood that this requires obtaining the position information of the boundaries between the images in the sub-segment before requesting the corresponding sub-segment. This indexing must first be obtained by the client. According to another aspect of the invention, the information representative of a data type is obtained by sending a segment description request to the server equipment and receiving a description file of a coding structure of the segment comprising The MPEG DASH standard has provided an "On Demand" profile to allow a customer of a video on demand ("Video on Demand") application to move in a segment of a data stream and perform fast browsing functions such as "fast forward". The implementation of such functions requires in fact to know the structure of the coded data in order to locate the positioning of the reference images I and trigger the jump from one image I to another. The description information of the coding structure of the segment is contained in a description file of SSIX type (for "sub-segment index"). The invention advantageously proposes to take advantage of this description information for real-time purposes to better cut a segment into sub-segments and distribute them over the different access links to the network. According to another aspect of the invention, the step of measuring network parameters comprises measuring a latency time between the transmission of a transmission request of at least one sub-segment on a link and the reception of the requested sub-segment and in that said method comprises, in the event of a measured latency time greater than a predetermined threshold for said request, a decision step of triggering an action at least as a function of a priority level of decoding assigned to the requested sub-segment, said action belonging to a group comprising at least: retransmission of a new transmission request from the same sub-segment to another link; - Cancellation of the current request.
    [0009] One advantage is to quickly detect that a transmission problem has occurred and decide on a solution to set up to obtain the sub-segments requested by another link, minimizing the additional delay on the overall delivery of data. Taking into account the priority level of the data for the decoding of a sub-segment in the distribution of the sub-requests on the available links, proposed by the invention, makes it possible to limit the damage due to a possible non-reception of this sub-segment for the subsequent decoding of the multimedia data, especially in terms of rendering quality. If the sub-segment priority level is low, the triggered action will be the pure and simple cancellation of the request. Further processing of the data will be done without the missing sub-segment. An advantage of canceling a subquery, rather than letting it take its course, is to avoid unnecessary signaling and associated bandwidth occupancy. If, on the contrary, the priority level of the sub-segment is high, the triggered action is to issue a new request for the same sub-segment on another link. Both actions can of course be triggered simultaneously. According to another aspect of the invention, the client terminal and the server equipment are arranged to communicate according to an acknowledgment-exchange communication protocol, and when the decided action is a cancellation of the current request, the method comprises a step of transmitting an acknowledgment message to the server. It is to make the server equipment believe that the sub-segment has been received. This makes it possible to bypass an acknowledgment mechanism imposed by a communication protocol in connected mode, TCP type and to avoid the heaviness. According to another aspect of the invention, the received description file further comprises information representative of a data membership group and at least a first encoded data stream being available at a first rate and a second stream at a first rate. second rate, the method comprises a step of choosing a stream in which to require a sub-segment of the current segment, at least as a function of the measured network parameters, of the decoding priority level of the sub-segment of the membership group of the sub-segment data and the predetermined time constraint.
    [0010] One advantage is to take advantage of every available representation or stream quality at the server level to optimize delivery within a segment. In addition to an optimization of the use of resources based on a distribution of the sub-segments on the available links with a granularity finer than the segment, the invention also allows a finer rate adaptation than the prior art. Indeed, for a given sub-segment, the highest possible flow rate data stream is chosen, allowing on the one hand to satisfy the predetermined time constraint, while taking into account the group of membership of the data coded in the sub-segment. -segment. For example, this home group is a GoP comprising an Intra-type image and other P-type or B-type images that depend on the image I. It is understood that the images of the same GoP and therefore the sub- corresponding segments must be queried in the same stream. The invention thus allows an Intra adaptation by Intra. The method that has just been described in its various embodiments is advantageously implemented by a device for processing a multimedia data delivery request. The invention therefore relates to a device for processing a request for delivery of a multimedia data stream sent by a client terminal to a remote server equipment via a telecommunications network, said terminal being adapted to access said network by at least two links according to different types of access, said data having been encoded into at least one stream at at least a predetermined rate, said stream having been previously cut into a plurality of segments. According to the invention, said device comprises the following units implemented for a segment of said at least one data stream: - Determination of at least one sub-segment size at least as a function of the number of links and a Size of the data stream to be delivered Calculating partitioning of the segment into sub-segments according to said at least one determined size and a distribution of the sub-segments over the plurality of links at least according to a scheduling of the sub-segments in the partition; calculated and a predetermined time constraint; and - sending a plurality of requests for transmission of the sub-segments to the server on the plurality of links, at least according to the calculated distribution, a transmission request of a sub-segment on a link comprising at least one identifier segment, a sub-segment start index, and a sub-segment end index. Such a device can advantageously be integrated in a client terminal. The invention therefore also relates to a client terminal adapted to access a communication network by at least two links according to distinct types of access, comprising a device for processing a delivery request according to the invention.
    [0011] Alternatively, such a device can also be integrated in a proxy module adapted to be placed upstream of a client equipment. The invention therefore also relates to a proxy module arranged in a cut-off of a client terminal and to at least two links according to distinct types of access to access a communication network, characterized in that it comprises a processing device a request for delivery of data according to the invention. The invention also relates to a computer program comprising instructions for implementing the steps of a method of transmitting a request for delivery of a multimedia data stream as described above, when this program is executed. by a processor.
    [0012] This program can use any programming language. They can be downloaded from a communication network and / or recorded on a computer-readable medium. Finally, the invention relates to a recording medium, readable by a processor, integrated or not to the device for transmitting a request for delivery of a multimedia data stream according to the invention, possibly removable, respectively memorizing a computer program implementing a transmission method, as described above. 6. List of Figures Other advantages and features of the invention will appear more clearly on reading the following description of a particular embodiment of the invention, given as a simple illustrative and non-limiting example, and attached drawings, among which: - Figure 1, already described, schematically shows the exchanges implemented by a client equipment with server equipment for the delivery of a multimedia data stream adaptive streaming, according to the prior art ; - Figure 2 schematically shows a client equipment having multiple access links to a telecommunications network to require the delivery of a multimedia data stream to a server equipment, according to the invention; FIG. 3 schematically shows the steps of a method of transmitting a request for delivery of a multimedia stream by a client device according to one embodiment of the invention; FIG. 4A schematically shows an exemplary structure of an encoded image sequence implemented in one embodiment of the invention; FIG. 4B shows an example of quantities of coded information to be delivered by type of image structure according to an MPEG type coding scheme; FIGS. 5A, 5B and 5C schematically illustrate three examples of distribution of the segmented sub-segments in a segment on the various access links to the telecommunications network according to the invention; FIG. 6 schematically shows a diagram of the flows exchanged between a client equipment, a proxy module and a server equipment for the delivery of a multimedia data stream according to one embodiment of the invention; FIG. 7 illustrates, using a mean latency curve as a function of time, the step of choosing a representation for the segment being delivered according to one embodiment of the invention; Figure 8 schematically shows an exemplary rate adaptation to respond to a predetermined time constraint according to an embodiment of the invention; and FIG. 9 schematically shows an example of a simplified structure of a device for transmitting a request for delivery of a multimedia data stream according to the invention. 7. DESCRIPTION OF A PARTICULAR EMBODIMENT OF THE INVENTION The general principle of the invention is based on the division of data segments available from a server equipment into sub-segments of sizes determined by a client equipment at least in depending on the number of access links to the telecommunications network that it has, the performance of each of these links, for example in terms of latency and bandwidth and the size of the data stream to be delivered. Such a division reduces the transmission latency on each link and optimizes the use of the bandwidth available on the different links. In relation with FIG. 2, an exemplary context of implementation of the invention is considered. In particular, an UE client device is considered, for example a laptop, a tablet or a smart mobile phone (for "smartphone") connected to a telecommunication network RT, by a plurality of access links. In this example, the UE client equipment has: - a wired access Li link to an access point PA1, home gateway type or corporate (for "home gateway"); a link L2 for radio access to a PA2 access point, Wifi type according to the IEEE 802.11x standard; and of a link L3 for radio access to an access point PA3, for example a base station ("node-B" for 3G, "e-node B" for 4G, in English) of 3G type, 4G or a future generation of the 3GPP standard. For simplicity, there is shown a single telecommunications network RT. Of course, this network can be composed of several access networks, according to the access technologies that have just been mentioned as examples, WAN (for "Wide Access Network" in English) or mobile to the IP network. (for "Internet Protocol", in English).
    [0013] Through these different links, the UE client equipment can connect to an ES server equipment, for example in a client-server mode, a Web technology and an http type communication protocol to require the delivery of a multimedia data stream provided by the server equipment.
    [0014] In the remainder of the description, the term "link" refers both to a particular access Li to the telecommunications network RT available to the client terminal and to the entire path taken by the data exchanged by the client terminal with the server equipment by the client terminal. intermediate of this particular access. In the following it is considered that the UE client equipment and the ES server equipment are arranged to implement adaptive streaming technology according to the MPEG-DASH standard. In relation to FIG. 3, the steps of a method for processing a multimedia data delivery request according to one embodiment of the invention will now be described. The data delivery request was issued by a UE client equipment to an ES server equipment. It is considered that the method which will be described can be implemented by a device integrated in the client equipment itself or by a proxy module placed in a cutoff between the links Li, L2, L3 of access to the network and the customer equipment. The device according to the invention is thus arranged to intercept the request and process it. During a step El, a request for description of the data to be delivered, issued by the client equipment and received by the device according to the invention, is transferred to the ES server equipment. For example, this request is of type "MPD request". In response, a description file of the type MPD is obtained. In known manner, such a file describes the different segments of the multimedia data stream that are available at the ES server equipment in each of the possible representations of the same stream, each corresponding to a given bit rate, and therefore to a given quality. In particular, for a segment S of a given representation, the description file comprises at least the size of the segment and location information of this segment, for example of the type url to access the entire segment. With the invention, it is necessary to access further information representative of the positioning of the sub-segment in the data stream (for "byte range", in English), for example a byte index of the beginning of under -segment and an end index of sub-segment. However, in the context of a "on dennand" type profile, the MPEG-DASH standard exploits an ISO Base Media File Format or ISOBMFF type file, including an @SIDX address where a detailed description, called SSIX (for " Sub Segment Index ", an encoded structure of the S segment for a representation F (S). This detailed description associates with positioning information, for example a start index (in bytes) and an end index, information representative of a type of coded information.
    [0015] This profile is intended to allow a client of a video on demand application ("Video on Demand") to move through a segment of a data stream and perform type-reading functions. Fast forward (for "fast forward"). The implementation of such functions requires in fact to know the structure of the coded data in order to locate the positioning of the reference images I and trigger the jump from one image I to another. During a step E2, the device according to the invention therefore requires a detailed description of the different SSIX associated with the quality representation F (S) of the segment S at the @SIDX address obtained. For example, in the case where the data stream represents an encoded video sequence, such a description provides information on the type of coded picture in the S-segment and on a membership group of the coded data. According to a coding scheme of the MPEG type for example, the images of a sequence are grouped together in GOP (for "Group of Pictures"). According to one embodiment of the invention, it can request a single description corresponding to a particular representation F (S). According to another mode, it requires several descriptions corresponding to several representations. In relation with FIG. 4A, a typical example of a GOP structure comprising images of different types is presented: a reference image, called image I, coded independently of the other images, predicted P-type images, coded by prediction relative to the reference image I and bidirectional type B images, coded by prediction with respect to two past or future I, P or B images. It is thus clear that the description SSIX associates an image type and a membership group with data positioning information or byte range in the segment S for a given representation quality F (S). In connection with FIG. 4B, an example of a load Ch (frame load) is presented in terms of data quantities encoded by FT type of image of a GoP. This is a good illustration of the fact that a reference image I represents a much larger load than a P or B image and highlights the need to make the best use of available network resources to optimize the transmission of image I data. on which all other GoP images depend. During a step E4, a sub-segment size T1 is determined by link Li of access to the network RT available at the level of the client equipment UE, with i integer between 1 and the number of links, at least depending on the data volume of the segment to be delivered in the chosen representation and the number of access links available. A first simple embodiment of this step is to divide the size of the segment to be delivered by the number of access links. Advantageously, this step E4 also takes into account parameters representative of a state of the communication channel on each of the available access links. These parameters have for example been measured beforehand during a previous delivery of another data stream or a previous segment of the same data stream. They include, for example, a latency measurement, a transmission rate measurement, a measurement of a data loss rate or a jitter measurement, ie a measurement of transmission delay between two data packets required simultaneously. These parameters provide information on a capacity of the link considered to transmit a sub-segment in terms of download speed, delay, reliability, loss rate, etc. It is understood that these parameters have an impact on the size of a sub-segment. For example, for a link associated with high latency, a small sub-segment size will be determined.
    [0016] A sub-segment size adapted to a type of link takes into account the effectiveness of the link, in terms of latency and throughput. The latency is classically derived from the RTT (for "Round Trip Time", in English); the efficiency of a link Li is for example represented in the form of an effective weight Epi, which can be expressed as follows: bpi min [RTT (LtN) 1 Epi = 66. +33. bpi min [RTT (Li)] Eq 1 in which bpi is the bandwidth measured on the path corresponding to the link Li and RTT (Li) the "Round Trip Time of the link Li. According to this example, we give a weight three times more important to the bitrate than the latency. The size of the sub-segment will then be calculated according to a distribution algorithm, for example: Ti = TS x [Ep / ZEpi], with TS segment size.
    [0017] Advantageously, this step E4 exploits the knowledge of the data structure of the segment obtained in E2. For example, it privileges the fact of cutting the segment into sub-segments comprising data of one and the same type, to facilitate the processing of the sub-segments in particular in their decoding phase. It is therefore a question of finding a compromise between a sub-segment size that satisfies the transmission constraints on a link and a size that minimizes the number of "hybrid" segments, that is to say grouping data from each other. at least two different types. At the end of step E4, a sub segment size T1 adapted to each access link Li to the network RT is determined. During a step E5, the sub-segment sizes determined are used to cut the segment to be delivered in sub-segments and to distribute the sub-segments cut on the different access links to the telecommunications network RT. This step takes into account a scheduling of sub-segments in the segment to be delivered. Indeed, to be able to decode and play without waiting the data flow as and when receiving the sub-segments, we must receive them in order. Therefore, sub-segment requests should be spread over each link to receive the sub-segments according to their initial scheduling in the segment to be delivered. At this stage, it is understood that the steps of determination of sub-segment sizes, division of a segment into sub-segments of the determined size (s) and distribution of the sub-segments obtained on the Li links are closely interleaved, especially when determining a size by link and taking into account the structure of the coded data during these steps. In relation to FIGS. 5A and 5B, two examples of division of a segment S into sub-segments of size Ti determined for the link L1, T2 determined for the link L2, T3 determined for the link L3 and the distribution of the variables are presented. sub-segments obtained on the three available links L1, L2, L3. In the example of FIG. 5A, the segment S is cut in a succession of a distribution sequence which comprises a sub-segment SST1 of size Ti which will be requested on the link Li, an SST2 sub-segment of size T2 to query on the link L2 and a sub-segment SST3 of size T3 to query on the link L3. In the example of FIG. 5B, the sizes Ti, T2, T3 determined are identical, but the distribution sequence is chosen differently: 2 successive sub-segments of size Ti are attributed to the link Li, followed by a sub-segment of size T2 attributed to the link L2 and a sub-segment of size T3 attributed to the link L3.
    [0018] Advantageously, this step takes into account firstly the knowledge of the parameters representative of a state of the communication channel on each of the links. Indeed, they are indicative of a level of reliability of each of the links, a bit rate, a bandwidth, etc. In other words, we will ask more sub-segments to a link, for example L1 which has a higher bit rate than a link, L2 or L3 which has a lower bit rate. Advantageously, this step E5 also takes into account the knowledge of the SSIX structure of the segment S, obtained in E2. Advantageously, a priority level has been previously assigned to each type of data that can be included in a segment and this priority level is used to decide the distribution of the segments on the various links. By way of example, the case of an image sequence organized in GOP is again considered. It is understood that reference images of type I are very important for the decoding of the GOP because they serve as a basis for the decoding of other types of images, of which only the residual error with respect to this reference image has been transmitted in the data flow. It is therefore relevant to assign a higher priority level to the I-frames than to the P-frames or B-frames of images that may be in terms of the type of coded picture. Advantageously, the step E5 also takes into account the knowledge of the structure of the coded data to split a segment into sub-segments and to distribute the requests of sub-segments on the various links, for example by associating a decoding priority level with a sub-segment depending on the type of data it contains. In relation to Figure 5C, the S-segment first includes type I data and then P-type data. Assume that a priority level 1 is assigned to type I data and a priority level 2 to type P. The step E4 of distribution of the sub-segments on the links L1, L2, L3 available advantageously exploits this level of priority and favors the links L1 and L2 which are more reliable to require the sub-segments of type I. on the other hand, it affects the P-type sub-segments at the L3 link considered less reliable. During a step E6, sub-segments SReq (SSn) for sub-segments SSn of the segment S are sent to the server equipment ES on the different access links to the network RT, according to the distribution. which has just been determined. By way of example, consider a time segment of 1s composed of an Intra (I) image of several hundred kilobytes (Kb) of data followed by several Predicted (P) images of a few tens of Kb and several bi-directional images or B of a few KB. A maximum priority level is associated with sub-segments SST11, SST22, SST12, SST22 and SST13 which comprise the coded data of this image I. They are thus distributed over the links L1, L2 the more efficient in terms of latency and bandwidth. It will be understood that this first distribution of the sub-segments of image I is important because it determines the overall latency of the delivery of the segment. Indeed, the images P which are based on the decoded I-image are expected by the decoder of the client equipment after the arrival of the Intra image, so we have a little more time to transmit them, for example using a 3G mobile radio link; such as the link L3, which is less efficient in terms of bit rate and latency, but which, because of its constant bit rate, guarantees the reliability of the transmitted data. As for the images B, they are distributed over the different links following the sub-segments of the image I. Note that these images are less important for the decoding, because they do not serve as a reference to any other image of the GoP. They are therefore associated with a low priority level. An option may be to decode them when they are transmitted to the client equipment with proper latency and to ignore them if they are not. During a step E6, the sub-segments are queried on the different links.
    [0019] It is first considered that the SReq subqueries relate to the first segment of the data stream. If the determined distribution corresponds to the example of FIG. 5A, a sub-request of delivery of the first sub-segment SST1 is sent on the link L1, a sub-request of delivery of the second sub-segment SST2 is emitted on the link L2, a sub request for delivery of the second sub-segment SST3 is issued on the link L3.
    [0020] Advantageously, these sub-requests are transmitted simultaneously on the three links so as to optimize the use of the available transmission resources. If the determined distribution corresponds to the example of FIG. 5B, the same delivery sub-request issued on link L1 may advantageously concern several sub-segments, such as for example the first and the second sub-segment SS-rii, SS112.
    [0021] As soon as it has issued sub-requests, the process goes to E7 waiting for the responses of the ES server equipment. In E8, it receives the first Resp (SSn) responses from the server equipment. The process is then repeated for the next subsequence sequence. In E6, sub-segment delivery sub-queries of the S-segment can be handled in different ways. According to a first aspect, a first salvo of sub-requests is sent simultaneously on the various links, on the basis of a sub-query by link. We then wait for the receipt of the required sub-segments before triggering the issuing of new subqueries. This management mode corresponds to a classic mode.
    [0022] Advantageously, a "burst" type transmission mode (also known as http pipelining) can be implemented, which consists of sending a series of sub-segment requests subsequently on the same link, a subsequent request being sent before to have received the answer from the previous request. In a context of real-time reception, this management mode, because it requires the maximum resources for transmission and processing of the server equipment, optimizes the transmission time.
    [0023] For example, one could consider bursting all the sub-segments sub-segments assigned to a link during the distribution step, but this mode can only be triggered if the real-time behavior begins to pose. problem for example in the case of a "heavy" Intra image which constitutes a large data file and which despite the small buffer of the decoder (for example 40ms of buffer) risks to shift the arrival of the other images and make lose the live clock, and in this case accelerate the download of the following images through this burst mode makes sense. On the contrary, when everything happens almost synchronously, a sequential mode can be sufficient.
    [0024] Whatever the mode of issuing sub-queries implemented, the method triggers, following the transmission of one or more sub-requests on a link, a step E9 of measuring a latency time TL between issuing a subquery and receiving a response to the subquery on the link. More generally, this step E9 measures other parameters representative of the state of the network on the links Li, L2, L3 and updates the parameters previously used in particular to determine a sub-segment size adapted to each link. It is understood that these new measures are particularly instructive since they concern the transmission of sub-segments whose size has been determined to be as adapted as possible to the transmission conditions on a link. They make it possible to verify that it is optimal and that the constraint of delay CD is well respected. Advantageously, the method comprises a step E3 of choosing a representation for the segment being delivered. This step exploits the network parameter measurements made in E9, in particular the TL latency measurement.
    [0025] At the beginning, the client terminal requested the S segment in a particular representation. Then, if the CD delay constraint is not respected, or if on the contrary the network conditions are favorable, step E3 makes it possible to decide to change the representation before the end of the delivery of the current segment. If the constraint is exceeded, it will choose a representation of lower rate, thus less expensive in bandwidth. On the contrary, if the measured latency time is less than the constraint, it chooses to switch to a higher rate representation to optimize the quality of the data delivered.
    [0026] The invention therefore makes it possible to adapt to changing network conditions with finer granularity than the segment. Of course, we understand that it is not always appropriate to decide to change representation anywhere in the same GoP. In particular, the group membership and data type information obtained in step E2 should be considered. Indeed, the sub-segments corresponding to an image P or B which depend on a reference image I must be extracted from the same representation as the sub-segments corresponding to this image I, so that the decoding is possible at the level of customer equipment. It will be understood that it will be possible to change the representation from the following image I. The invention therefore makes it possible to follow the delay constraint with a granularity from intra to intra. Advantageously, the method then reiterates the step E4 for determining a size of a sub-segment by link from the new network parameter measurements and the step E5 for segment splitting and distribution of the sub-segments on the links, based on new network parameter metrics and updated sub-segment sizes. In this way, the structure of the sub-requests is changed in real time to adapt to the real conditions of transmission on the different links. Of course, depending on the size of a segment, it is possible to apply the calculated updates to the next segment, which seems to be a good compromise between complexity and adaptability. In this way, the structure and distribution of the subqueries for a current segment is based on the measurements made during the delivery of the previous segment. To minimize the overall delay of the transmission of data segments, the method according to the invention proposes to control the maximum quality of the segments delivered for a predetermined latency setpoint. For example, a 70ms live delay is set, and the method calculates the corresponding download times for each of the available adaptive bitrate levels and chooses the most optimal representation.
    [0027] When the measured TL latency time for a subquery exceeds a predetermined threshold, for example 70ms (which includes the RTT, ie the delay between the transmission of an uplink request http and the return reception of the first one). data bit to which the download time is added, eg on a network with a 30ms RTT, there is 40ms left to download the data), whereas no response to a subquery has been received, a step E10 is implemented during which it is decided to take action to remedy this problem. Several actions can be decided. This decision step can advantageously take into account the knowledge of the structure of the segment obtained during step E2 and in particular the level of priority which has been associated with the (x) sub-segments not received. This level of priority is valuable information for deciding whether the reception of this sub-segment is important for the decoding of the data stream or if on the contrary, we can do without it, with locally and temporarily degraded image quality . If the reception of this sub-segment is considered important, for example because it is associated with a high priority level, it may be decided to renew the issue of the sub-query on another, more reliable link. It is understood that, due to the real-time constraint associated with the delivery of the segment of the data stream, it is not possible to wait for delivery on the faulty link beyond a predetermined time. If the reception of this sub-segment is not considered essential, a decision may be to do nothing and decode the segment without the missing sub-segment. At this stage, we consider a particular embodiment of the invention according to which the client equipment is an MPEG-DASH client and the communication mode implemented between the UE client equipment and the ES server equipment is in accordance with HTTP protocols (for "Hypertext Transfer Protocol" in English) over TCP (for "Transmission Control Protocol"). According to the latter protocol, the client equipment and the server equipment establish beforehand a communication session during which the client equipment can issue a delivery request to the server equipment. Once he has received the response to his request, the client equipment acknowledges the server equipment. As long as it has not received an acknowledgment of receipt of the client equipment, the server equipment regularly re-answers the response to the request of the client equipment. It is understood that this protocol ensures the communication of data between the two devices, but that in case of transmission problem, the retransmission mechanism generates traffic and latency on the link which is not very compatible with real-time issues. In this context, step E10 may advantageously decide to cancel an http subquery that does not receive a response on a link in the imposed time. In the previous embodiment, this cancellation action is interesting for the images, so the non-priority sub segments. It includes closing the current session with the server equipment on the relevant link. The advantage of this cancellation is to terminate the traffic and signaling for example according to the TCP protocol generated between the client equipment and the server equipment, which occupy the resources of these two devices. According to one variant, instead of canceling the current subquery, it may be decided to systematically acknowledge the response even if it is not received. The effect produced on the server equipment side will be the same as before, ie the closing of the current session.
    [0028] It is understood that it can be decided to carry out several actions simultaneously, for example to cancel a sub-query in progress on a link, to put an end to the traffic that its processing generates and to renew the transmission of this subquery on another link, considered more reliable, to limit the delay in receiving the complete segment.
    [0029] In E11, the segment is reconstructed from the received sub-segments and then transmitted at E12 to the client UE, in response to its initial request. The steps of the method are then repeated for the next segment of the data stream. In connection with FIG. 6, for example, the case of a first client device having wired access LO to the network RT with a bit rate of 12 Mb / s is considered. The first image I needs 266 ms to be delivered. The real-time latency delay LDL is 266 ms. Other images are small and are transmitted in less than 30 ms. It is not efficient to under-segment them further. We then consider the case of a second client equipment with 4 wired accesses 1, to 4 ADSL type (for "Asymmetric Digital Subscriber Line" in English) and 4G mobile access L'5, and implementing the method according to the invention. The image I corresponds to a data volume of 400 Kb. It is divided into 5 sub-segments of variable sizes to be queried on each of the 5 links, according to the efficiency Epi of each link, which can, at As an example, be calculated from one of the following equations: in the case where the access links are very close in terms of latency but have flow rate differences: bpi ± 33.min [RTTp (1, n)] (Eq 1) Epi = 66. E (1, n) bpi mireTT (pi)] in the case where the access links are very heterogeneous in terms of latency: Epi = 66. bpi ± 33. (1) - RTT (pi) / E (1, n) RTT (pi) (Eq 2)> (ln) bpi (p-1) The size of a sub-segment adapted to the link The i is calculated as follows , depending on the efficiency Epi of the link The i: = TF. Epi (Eq. 3) E (1, n) EPt with TF size of the current image to download in the segment S. In this way, we divides the download of a TF image on the various links The i available in functio n their respective efficiencies.
    [0030] Thus the sub-segment of data corresponding to a complete Intra image will be downloaded in parallel on the links of different efficiency in terms of bit rate and latency: for the link The l having a bit rate equal to 14 Mbps, a RTT equal to 21ms and of an efficiency Ep = 66 x 14/72 + 33 x U145-21) / 1451/4 = 20, a sub-segment size equal to 80Ko is determined; - for the link The 2 having a bit rate equal to 11Mbps, a RU equal to 27ms and an efficiency equal to Ep = 66 x 11/72 + 33 x [(145-27) / 1451/4 = 17, a sub-segment size of 68Ko is determined; for the link 3 having a bit rate equal to 5 Mbps of a RU equal to 31 ms and an efficiency Ep = 66 x 5/72 + 33 x [(145-31) 11451/4 = 11, the determined sub-segment size is 44Ko; for the link The 4 having a flow equal to 7Mbps, a RU equal to 36ms, of an efficiency equal to Ep = 66 x 7/72 + 33 x [(145-36) / 145] / 4 = 13, a sub-segment size equal to 52Ko is determined; - for the link L'5 having a bit rate equal to 35Mbps, a RU equal to 30ms) and an efficiency equal to Ep = 66 x 35 / 72 33 x [(145-30) 11453/4 = 39, a sub-segment size of 156Ko is determined. It is understood that with the invention each link has a contribution in terms of the volume of data delivered to the delivery of the data corresponding to its performance in downloading time measured from the network parameters. The times of downloads of the different sub-segments on the different links will depend on the nature of the link (latency and bandwidth) Experimentally for the 5 links given in the example, we obtain for L'1 a download time of 68ms, for the link The 2 a time of 74ms, for the 3 a time of 105ms, for the 4 a time of 89ms and for the 5 a time of 54ms. The largest sub-segment is delivered in 105 ms. As a result, the real-time latency delay LDL 'is reduced to 105 ms.
    [0031] In the example considered in connection with FIG. 7, another example is considered according to which the ES server equipment makes available 4 representations or streams of data for the same content: an F1 stream encoded at 500 kbps; a F2 stream encoded at 1000 kbps; an F3 stream encoded at 2000 kbps; and an F4 stream encoded at 3500 kbps.
    [0032] The same figure shows an LTM curve of the mean latency of the various network links as a function of time and a representation in steps of the qualities of representation chosen by the device according to the invention over time.
    [0033] To satisfy a predetermined CD delay constraint, in this example equal to 70 ms, the method according to the invention chooses, during a step E3, a representation at a bit rate BR among those available (F1 to F4), for example Fi at 500 Kbps; to require the first sub-segments. This choice takes into account not only the CD delay constraint, but also the network conditions. In this example, we see that we start reading coded data quality Fi, the lowest available, which allows to start the reading by ensuring the delay setpoint. For the next GoP we switch to quality F3 quality, which respects the set. This regime continues during the transmission of several GoPs until the appearance of a network problem, and in response to an increasing average latency, it returns to the quality F2. Then, considering that the measured average latency decreases, one switches to a higher quality representation F4. In relation to FIG. 8, a diagram of the flows exchanged between a UE client device, an MP proxy module and an ES server equipment according to an exemplary embodiment of the invention is now presented. In this example, the module MP, placed upstream of the client equipment UE, implements the method of processing a request for delivery of a data stream according to the invention which has just been described in relation to the Figure 3 This module has access to the various links Li, L2, L3, available to the customer equipment. In this example, the UE client equipment complies with the MPEG-DASH standard and its operation is not affected by the invention. In known manner, the UE client device sends a request "MPD Request" description of a FD data stream to the ES server equipment on one of its links Li, L2 or L3 RT network access. In El, this request is relayed transparently by the MP proxy module and transmitted to the ES server equipment The ES server equipment responds by transmitting the corresponding MPD description file.
    [0034] In known manner, the client terminal UE requires the delivery of a segment S of the data stream to the server ES by issuing a request of the type http Req (S) on the same link Li as before. This request is intercepted by the proxy module MP, which sends in E2 a request "SIDX Request" of description of the segment S to the server ES on one of the available links, for example the link Li chosen by the client UE. In response, the ES server sends it the SIDX description file (SSIX) of the S-segment. In E3, the proxy module can choose a representation to request the S-segment. In the beginning, it usually chooses the representation required by the client terminal. . From the information contained in this file, concerning the structure of the multimedia data coded in the segment S for each of the representations and the knowledge of parameters representative of a state of the network on the available links, the proxy module determines in E4 a size of sub-segment adapted to each link Li.
    [0035] Then, in E5, the proxy module MP divides the segment S into sub-segments of determined sizes and distributes them on the different links. In E6, it sends first S-Req subqueries (SSn, Li) on the various links. In E7, it is waiting for reception of the first answers.
    [0036] The ES server, upon receipt of the SReq subqueries (SSn, Li), issues responses comprising the SSn sub-segments requested on the relevant Li links. Then, it waits for an acknowledgment from the EU client. In E8, the module MP receives the first S-Rep responses (SSn, Li), stores them in memory, for example in a buffer.
    [0037] On receipt of the first responses, it updates in E9 the network parameter measurements, in particular TL latency times of the links concerned. Advantageously, the steps E3, E4 and E5 are repeated to take into account the new measurements of network parameters and to optimize the choice of the representation, the sizes of sub-segments and the distribution of the sub-segments on each link.
    [0038] Advantageously, the sub-segments corresponding to a priority Intra image are requested several times on different links measured as very effective. According to such an option, the proxy module takes into account on the proxy side only the sub-segments that have arrived first. One advantage is to avoid retransmissions that may no longer be achievable in the predetermined time setpoint. If, beyond a predetermined latency, sub-segments have not been received, the proxy module decides in E10 an action to trigger to remedy, for example require the sub-segment on another link , cancel the current request etc. The request step E6 is iterated to request the following sub-segments.
    [0039] As previously described, different strategies can be put in place. For example, the MP proxy module waits to have received the previous sub-segments on the different links to request the following, which allows to take into account the new network parameters measurements and thus optimize the exploitation of the resources of the various links . One variant is to request the sub-segments assigned to a given link in burst mode, without waiting for the reception of the first sub-segments. One advantage is to minimize latency on this link. On the other hand, optimization of the distribution can only be implemented for the next segment. Once it has received all of the possible sub-segments of the S-segment, the MP module reconstructs the sub-segment at E11 and transmits it to the UE client at E12 in the form of an http response Rep (S) conforming to the MPEG-DASH standard. Depending on the communication protocol used, the UE can acknowledge receipt of the required S segment. In this case, the MP proxy module does not retransmit the acknowledgment message to the ES server. It is understood that according to this embodiment, the UE client can continue to operate normatively, while benefiting from optimized delivery, which exploits all the links that it has to access the telecommunications network. It will be noted that the invention which has just been described can be implemented by means of software and / or hardware components. In this context, the terms "module" and "entity" used in this document may correspond to either a software component, a hardware component or a set of hardware and / or software components capable of the function (s) described for the module or entity concerned. With reference to FIG. 9, an example of a simplified structure of a device 100 for transmitting a request for delivery of a multimedia data stream according to the invention is now presented. The device 100 implements the transmission method according to the invention which has just been described in relation to FIG. 3. For example, the device 100 comprises a processing unit 110, equipped with a processor p1, and driven by a computer program Pg1 120, stored in a memory 130 and implementing the method according to the invention.
    [0040] At initialization, the code instructions of the computer program Pgi 120 are for example loaded into a RAM memory before being executed by the processor of the processing unit 110. The processor of the processing unit 110 sets implement the steps of the method described above, according to the instructions of the computer program 120.
    [0041] In this exemplary embodiment of the invention, the device 100 comprises at least one GET MPD unit for obtaining a description file of the data stream, a DET T unit for determining a non-link sub-segment size. access network RT, a PARTIT S unit partitioning an S segment into sub-segments according to the determined sizes, a SEND SReq) transmission unit of a sub-request of a sub-segment on a Li link and a receiving SSn SSn receiving SSn sub-segment required. Advantageously, the device 100 further comprises a GET STR unit for obtaining a structure of the data of the segment S, a unit MEAS NP of measurements of state parameters of the network on the links Li, L2, L3, a unit DEC. F (S) of choice of a representation of the segment S, a decision DEC ACT unit of an action to be triggered, when the sub-segment has not been received at the end of a predetermined latency And a RECONST S reconstruction unit of the S-segment once all sub-segments have been received. The device 100 further comprises a unit BD1 for storing the received sub-segments. This is for example a small buffer allowing on the one hand to wait for the completeness of an image that arrives and secondly to have a slight buffer time to ensure the timing of decoding. In the implementation of the method, 40ms suffice which can therefore induce a delay of 0 to 40nns. An important point is the reception of the sub-segments by a device 100 integrated with the proxy described above, it takes care to order the sub-segments to transmit them to the DASH client but does not reconstitute the complete image before transmitting it to the customer, which would inevitably increase the overall time. These units are driven by the processor t1 of the processing unit 110. Advantageously, such a device 100 can be integrated with a client terminal UE or an MP proxy module placed upstream of a client equipment according to the art. prior. An advantage of such a proxy module is that it makes it possible to implement the invention from a customer equipment already on the market, without it being necessary to modify the operation of the customer equipment. The device 100 is then arranged to cooperate at least with the following modules of the terminal UE or the proxy module MP: a data transmission / reception module E / R, via the requests are transmitted in the telecommunications network RT to the ES server equipment, for example the different access links L1, L2, L3 available at the UE client, for example a wired access network WAN or an access network without Wi-Fi type wire or a 3G, 4G or future generation 3GPP mobile network; a DEC module for decoding the coded data contained in the sub-segments received by the UE client equipment or the MP proxy module. The invention which has just been presented finds numerous applications involving the delivery of data, for example multimedia, with time constraints, up to the real time. In fact, on the client side, the method of processing a delivery request according to the invention is capable of organizing the delivery of the data by optimizing the bit rate and the available network resources while complying with a "live delay" instruction. For example, it could be exploited to implement an online voting service (for "video-voting" in English), network gaming (for "cloud gaming", in English or video conferencing.
    [0042] It goes without saying that the embodiments which have been described above have been given for purely indicative and non-limiting purposes, and that many modifications can easily be made by those skilled in the art without departing from the scope. of the invention.
    权利要求:
    Claims (12)
    [0001]
    REVENDICATIONS1. A method of processing a data delivery request sent by a client terminal to a remote server equipment via a telecommunications network, said terminal being adapted to access said network by at least two links according to distinct access types, said data having been encoded into at least one stream at at least a predetermined rate, said stream having been previously cut into a plurality of segments, said method comprising the following steps, implemented for a segment of said less than one data stream: - Determination (E4) of at least one sub-segment size at least as a function of the number of links and a size of the data stream to be delivered; - Calculation (E5) of partitioning the segment into sub-segments according to said at least one determined size and a distribution of the sub-segments on the plurality of links at least according to a scheduling of the sub-segments in calculated partitioning and a predetermined time constraint; - Emitting (E6) a plurality of transmission requests of the sub-segments to the server on the plurality of links, at least according to the calculated distribution, a transmission request of a sub-segment on a link comprising at least a segment identifier, a sub-segment start index, and a sub-segment end index.
    [0002]
    2. A method of processing a data delivery request according to claim 1, characterized in that it comprises a step (E9) for measuring parameters representative of a state of the network on the plurality of links, implementation on receiving sub-segments from the server on said links in response to the requests issued and a step of updating the steps of determining a sub-segment size per link and calculating a partitioning and a distribution of the sub-segments on the links according to the parameters measured.
    [0003]
    3. A method of processing a data delivery request according to claim 2, characterized in that it comprises a step of determining a transmission frequency of the requests on a link according to the measured network parameters and in that the transmission requests of the sub-segments on said link are transmitted at the determined transmission frequencies.
    [0004]
    4. A method of processing a data delivery request according to one of the preceding claims, characterized in that it comprises a step (E2) for obtaining a coding structure comprising at least one piece of information representative of a type of data encoded in the segment associated with a position information of such data, a step of assigning a decoding priority level to sub segments of a segment based on the type information and predetermined rules, and in that the step of partitioning the segment into sub-segments and the step of distributing the sub-segments on the plurality of links also take into account the levels of decoding priorities assigned to the sub-segments. .
    [0005]
    Method for processing a data delivery request according to claim 4, characterized in that the information representative of a data type is obtained by issuing a request for description of the segment to the server equipment and receiving a description file of a coding structure of the segment comprising said information.
    [0006]
    6. A method of processing a data delivery request according to one of claims 4 and 5, characterized in that the step of measuring network parameters comprises the measurement of a latency time (TL) between the transmitting a transmission request (SReq) of at least one sub-segment on a link and receiving the requested sub-segment and in that said method comprises, in the case of a measured latency time greater than a predetermined threshold for said request, a decision step (E10) for triggering an action at least depending on a decoding priority level assigned to the requested sub-segment, said action belonging to a group comprising at least: - Retransmission of a new request to transmit the same sub-segment on another link; - Cancellation of the current request.
    [0007]
    7. A method of processing a data delivery request according to claim 6, characterized in that, the client terminal (UE) and the server equipment (ES) being arranged to communicate according to a communication protocol with exchange of data. acknowledgment, characterized in that when the action decided is a cancellation of the current request, the method comprises a step of transmitting an acknowledgment message to the server.
    [0008]
    8. A method for processing a data delivery request according to one of claims 5 to 7, characterized in that the description file (SSIX) received further comprises information representative of a group of data belonging. and in that at least a first stream of encoded data is available at a first rate and a second stream at a second rate, the method comprises a step of choosing a stream in which to require a sub-segment of the current segment, at least according to the measured network parameters, the sub-segment decode priority level of the sub-segment data membership group, and the predetermined delay constraint (CD).
    [0009]
    9. Device (100) for processing a data delivery request sent by a client terminal (UE) to a remote server equipment (ES) via a telecommunications network (RT), said terminal being adapted to access said network by at least two links according to different access types, said data having been encoded into at least one stream at at least a predetermined bit rate, said stream having been previously cut into a plurality of segments, said device comprising the following units implemented for a segment (S) of said at least one data stream: - Determination (DET Ti) of at least one sub-segment size at least as a function of the number of links and of a size of the data stream to be delivered; - Calculation (PARTIT S) of a partitioning of the segment (S) into sub-segments according to said at least one determined size and a distribution of the sub-segments on the plurality of links at least according to a scheduling sub-segments in calculated partitioning and a predetermined delay constraint (CD); and transmitting (SEND SReq) a plurality of requests for transmission of the sub-segments to the server on the plurality of links, at least as a function of the calculated distribution, a transmission request of a sub-segment on a link comprising at least one segment identifier, a sub-segment start index, and a sub-segment end index.
    [0010]
    10. Client terminal (UE) adapted to access a communication network by at least two links according to different types of access, characterized in that it comprises a device for processing a delivery request sent by the client terminal. to a server equipment connected to said network according to claim 9.
    [0011]
    11. Proxy module (MP) arranged in break of a client terminal (UE) and at least two links according to different types of access to access a communication network (RT), characterized in that it comprises a device (100) for processing a data delivery request sent by the client terminal to a server equipment (ES) connected to said network, according to claim 9.
    [0012]
    Computer program (Pg1) comprising instructions for carrying out the method of processing a data delivery request according to one of claims 1 to 8, when executed by a processor.3013. Recording medium, readable by a processor, characterized in that it stores the computer program (Pg1) according to claim 12.
    类似技术:
    公开号 | 公开日 | 专利标题
    EP3238406B1|2019-07-31|Treatment method of application data delivery
    CN107210993B|2020-11-10|Method and system for dynamic rate adjustment of multimedia content streams in a wireless network
    US9178929B2|2015-11-03|Client-side class-of-service-based bandwidth management in over-the-top video delivery
    US10735823B2|2020-08-04|System and method for optimized delivery of live ABR media
    EP3318067A1|2018-05-09|A media user client, a media user agent and respective methods performed thereby for providing media from a media server to the media user client
    US9838724B2|2017-12-05|Media distribution network for live streaming
    WO2011100901A2|2011-08-25|Method, device and system for transmitting and processing media content
    EP3269111A1|2018-01-17|System and method for optimized delivery of live adaptive bitrate | media
    WO2010042041A1|2010-04-15|Supporting functions for quality-assured p2p vod services
    EP3001633B1|2017-08-16|Server, client, method and computer program product for adaptive streaming of media content to a client
    Bouten et al.2013|A multicast-enabled delivery framework for QoE assurance of over-the-top services in multimedia access networks
    Evensen et al.2014|Adaptive media streaming to mobile devices: challenges, enhancements, and recommendations
    WO2017182815A1|2017-10-26|Media data streaming method and apparatus
    EP3113442A1|2017-01-04|Method and server for improving quality in adaptive streaming delivery systems
    EP3646196A1|2020-05-06|Method and device for downloading audiovisual content
    EP2645647B1|2016-11-30|Method for optimising the downstream rate of an asymmetric subscriber line, corresponding device, computer program product and storage medium
    Ahsan et al.2018|DASHing towards hollywood
    CN111031340A|2020-04-17|Edge node control
    EP2575307B1|2015-01-07|Technique of distribution of a content in a communication network
    EP3062474B1|2018-09-26|Method, device, computer program product and storage medium for distributing file requests in adaptive streaming systems
    EP2854367B1|2019-09-11|Method for processing a request to deliver a stream of data, method for managing delivery resources, related devices and computer program
    EP3001688A1|2016-03-30|System and method for transferring adaptive streaming video between a server and a client
    WO2020070408A1|2020-04-09|Method for preserving a data transmission rate of a terminal in a communications network
    FR2982728A1|2013-05-17|TECHNIQUE FOR PROCESSING A REQUEST FOR THE DISTRIBUTION OF A CONTENT
    WO2019120532A1|2019-06-27|Method and apparatus for adaptive bit rate control in a communication network
    同族专利:
    公开号 | 公开日
    US10536503B2|2020-01-14|
    EP3238406A1|2017-11-01|
    EP3238406B1|2019-07-31|
    US20170331875A1|2017-11-16|
    FR3029376B1|2016-12-30|
    WO2016083740A9|2017-05-18|
    WO2016083740A1|2016-06-02|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    EP2613543A2|2010-09-01|2013-07-10|Electronics And Telecommunications Research Institute|Method and device for providing streaming content|
    EP2704449A1|2012-08-30|2014-03-05|Thomson Licensing|Rendering time control|
    WO2014096463A1|2012-12-21|2014-06-26|Koninklijke Kpn N.V.|Low-latency streaming|
    US8768895B2|2007-04-11|2014-07-01|Emc Corporation|Subsegmenting for efficient storage, resemblance determination, and transmission|
    WO2013072080A1|2011-11-14|2013-05-23|Telefonaktiebolaget L M Ericsson |Media streaming in mobile networks with improved efficiency|
    US9692800B2|2014-06-11|2017-06-27|Google Inc.|Enhanced streaming media playback|CN106231440A|2016-07-22|2016-12-14|华为技术有限公司|A kind of files in stream media burst method for down loading, device and terminal|
    CN107786440B|2016-08-26|2021-05-11|华为技术有限公司|Method and device for forwarding data message|
    US20180183845A1|2016-12-22|2018-06-28|Facebook, Inc.|Systems and methods for providing content|
    US10652166B2|2017-06-27|2020-05-12|Cisco Technology, Inc.|Non-real time adaptive bitrate recording scheduler|
    US20190205062A1|2018-01-04|2019-07-04|Western Digital Technologies, Inc.|Solid state drive stream allocation and mapping|
    CN108574735A|2018-04-11|2018-09-25|努比亚技术有限公司|Data processing method, terminal and computer readable storage medium|
    US11146839B1|2020-07-06|2021-10-12|Comcast Cable Communications, Llc|Adaptive bitrate streaming|
    法律状态:
    2015-11-23| PLFP| Fee payment|Year of fee payment: 2 |
    2016-06-03| PLSC| Search report ready|Effective date: 20160603 |
    2016-11-23| PLFP| Fee payment|Year of fee payment: 3 |
    2017-11-27| PLFP| Fee payment|Year of fee payment: 4 |
    优先权:
    申请号 | 申请日 | 专利标题
    FR1461650A|FR3029376B1|2014-11-28|2014-11-28|METHOD FOR PROCESSING A DATA DELIVERY REQUEST, DEVICE, PROXY MODULE, CLIENT TERMINAL AND COMPUTER PROGRAM|FR1461650A| FR3029376B1|2014-11-28|2014-11-28|METHOD FOR PROCESSING A DATA DELIVERY REQUEST, DEVICE, PROXY MODULE, CLIENT TERMINAL AND COMPUTER PROGRAM|
    US15/527,979| US10536503B2|2014-11-28|2015-11-26|Processing of a request for data delivery from a server to a client via a telecommunication network|
    EP15817454.0A| EP3238406B1|2014-11-28|2015-11-26|Treatment method of application data delivery|
    PCT/FR2015/053216| WO2016083740A1|2014-11-28|2015-11-26|Method for processing a data delivery request|
    [返回顶部]